Avoiding Irreducible CSC Conflicts by Internal Communication

STG Decomposition: Avoiding Irreducible CSC Conflicts by Internal Communication

Avoiding patterns in irreducible permutations

We explore the classical pattern avoidance question in the case of irreducible permutations, i.e., those in which there is no index i such that σ(i + 1) − σ(i) = 1. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary nu...

Csc Catalyst Ontology White Paper for Internal Use by Csc Employees and Authorized Subcontractors

No part of this product may be reproduced by any means, nor transmitted, nor translated into a machine language without written permission from Computer Sciences Corporation. Specifically defined collections of CSC Catalyst SM framework products may be licensed to third parties external to CSC. The remaining products— practice guides, service offerings, procedure guides, white papers, and colle...

Avoiding Resource Conflicts in Intelligent Agents

An intelligent agent should be rational, in particular it should at least avoid pursuing goals which are definitely conflicting. In this paper we focus on resource conflict in agents that use a plan library organised around goals. We characterise different types of resources and define resource requirements summaries. We give algorithms for deriving resource requirements, using resource require...

Combining cues while avoiding perceptual conflicts.

A common assumption in cue combination models is that small discrepancies between cues are due to the limited resolution of the individual cues. Whenever this assumption holds, information from the separate cues can best be combined to give a single, more accurate estimate of the property of interest. We examined whether information about the discrepancy itself is lost when this is done. In our...